a novel navigation method for pursuing a moving target

the most current pursuit algorithms for moving targets which are presented so far in the literatureare pure pursuit and pure rendezvous navigations. recently, one of the present authors has introduced ageometric model for the pure pursuit navigation algorithm. here, in this paper, we study a new algorithm forthe pursuit navigation problem which is a combination of both of the above algorithms. we study itsgeometric properties, as well as the trajectories as time optimal paths. finally, we compare this algorithm withwell-known algorithms in some real examples.